Revisiting Finite Field Multiplication Using Dickson Bases
نویسندگان
چکیده
Dickson bases have recently been introduced in [1] for finite field arithmetic. Such a basis exists for any extension field and under certain conditions it represents a permutation of type II optimal normal bases. In this paper Dickson bases are developed using simpler mathematical terms and their properties are discussed. An algorithm/architecture based on the model presented in [1] is developed. An alternate simpler multiplication algorithm is introduced, the results are compared to a typical serial polynomial base multiplier and VLSI implementation considerations are discussed.
منابع مشابه
Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation
We study Dickson bases for binary field representation. Such representation seems interesting when no optimal normal basis exists for the field. We express the product of two elements as Toeplitz or Hankel matrix vector product. This provides a parallel multiplier which is subquadratic in space and logarithmic in time.
متن کاملFinite Fixed Point Free Automorphism Groups
Preface A famous theorem by Frobenius in 1901 proves that if a group G contains a proper non trivial subgroup H such that H ∩ g −1 Hg = {1 G } for all g ∈ G \ H, then there exists a normal subgroup N such that G is the semidirect product of N and H. Groups with this property-the so called Frobenius groups-arise in a natural way as transitive permutation groups, but they can also be characterize...
متن کاملFinite field arithmetic using quasi-normal bases
Efficient multiplication in finite fields Fqn requires Fq-bases of low density,i.e., such that the products of the basis elements have a sparse expression in the basis. In this paper we introduce a new family of bases: the quasi-normal bases. These bases generalize the notion of normal bases and provide simple exponentiation to the power q in Fqn . For some extension fields Fqn over Fq, we cons...
متن کاملA New Bit-Serial Architecture for Field Multiplication Using Polynomial Bases
Multiplication is the main finite field arithmetic operation in elliptic curve cryptography and its bit-serial hardware implementation is attractive in resource constrained environments such as smart cards, where the chip area is limited. In this paper, a new serial-output bitserial multiplier using polynomial bases over binary extension fields is proposed. It generates a bit of the multiplicat...
متن کاملDickson Bases and Finite Fields
Finite fields have been used for many applications in electronic communications. In the case of extension fields, the nature of computation depends heavily on the choice of basis used to represent the extension over the base field. The most common choices of basis are polynomial bases although optimal normal bases or some variant of these have also been used despite the fact that such bases exi...
متن کامل